Computational problem

Results: 1172



#Item
391Polygons / Mathematics / Art gallery problem / VC dimension / Simple polygon / Area / Applied mathematics / Computational geometry / Computational learning theory / Geometry

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 VC-Dimension of Visibility on Terrains James King∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:05:06
392Intelligence / Psychology / Education / Computational neuroscience / Educational psychology / Problem solving / Troubleshooting

Approved for public release; Form Approved distribution unlimited.

Add to Reading List

Source URL: www.ai.sri.com

Language: English - Date: 2004-09-01 20:30:49
393Computational complexity theory / Computational geometry / Linear programming / Analysis of algorithms / LP-type problem / Algorithm / Time complexity / Streaming algorithm / Minimum bounding box algorithms / Theoretical computer science / Applied mathematics / Mathematics

CCCG 2006, Kingston, Ontario, August 14–16, 2006 A Simple Streaming Algorithm for Minimum Enclosing Balls Hamid Zarrabi-Zadeh∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-27 22:59:03
394Complexity classes / NP-complete problems / Parameterized complexity / Tree decomposition / Dynamic programming / NP-hard / NP / Clique problem / Theoretical computer science / Computational complexity theory / Graph theory

Improved Parameterized Algorithms for Network Query Problems Ron Y. Pinter, Hadas Shachnai, and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {pinter,hadas,meizeh}@cs.technion.ac.il Abstract

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2014-03-05 14:37:49
395Euclidean plane geometry / Discrete geometry / Computational geometry / Shortest path problem / Simple polygon / Visibility / Voronoi diagram / Visibility graph / Pseudotriangle / Geometry / Mathematics / Polygons

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Optimal schedules for 2-guard room search Stephen Bahun∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:30:44
396Applied mathematics / Operations research / Distributed constraint optimization / Convex optimization / Computational complexity theory / Constraint satisfaction problem / Linear programming / Constraint optimization / Combinatorial optimization / Constraint programming / Mathematical optimization / Theoretical computer science

Quality Guarantees on k-Optimal Solutions for Distributed Constraint Optimization Problems Jonathan P. Pearce and Milind Tambe∗ University of Southern California Computer Science Department {, tambe@usc

Add to Reading List

Source URL: teamcore.usc.edu

Language: English - Date: 2008-10-14 04:00:37
397Applied mathematics / Travelling salesman problem / Mathematical optimization / Complexity classes / Combinatorial optimization / Theoretical computer science / Computational complexity theory / Operations research

Hilldale Lecture Series In pursuit of the traveling salesman: Mathematics at the limits of computation

Add to Reading List

Source URL: www.secfac.wisc.edu

Language: English - Date: 2014-10-24 10:53:47
398Tree decomposition / Graph / Dynamic programming / Tree / Shortest path problem / Path decomposition / Planar separator theorem / Graph theory / Mathematics / Theoretical computer science

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Application of computational geometry to network p-center location problems Binay Bhattacharya

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:10:51
399Computational complexity theory / Simple polygon / 2-satisfiability / Rectilinear polygon / Optimization problem / APX / Vertex / Theoretical computer science / Polygons / Geometry

CCCG 2009, Vancouver, BC, August 17–19, 2009 Inapproximability of the Perimeter Defense Problem Evangelos Kranakis∗ Danny Krizanc†

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2009-09-02 14:33:48
400Computational complexity theory / Art gallery problem / Computational geometry / Reduction / Polygon / Simple polygon / Linear programming / Algorithm / Theoretical computer science / Applied mathematics / Mathematics

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 An Efficient Exact Algorithm for the Natural Wireless Localization Problem∗ Bruno E. Crepaldi† Pedro J. de Rezende†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2013-08-11 21:51:57
UPDATE